Stochastic Optimal Control for Online Seller under Reputational Mechanisms
نویسندگان
چکیده
In this work we propose and analyze a model which addresses the pulsing behavior of sellers in an online auction (store). This pulsing behavior is observed when sellers switch between advertising and processing states. We assert that a seller switches her state in order to maximize her profit, and further that this switch can be identified through the seller’s reputation. We show that for each seller there is an optimal reputation, i.e., the reputation at which the seller should switch her state in order to maximize her total profit. We design a stochastic behavioral model for an online seller, which incorporates the dynamics of resource allocation and reputation. The design of the model is optimized by using a stochastic advertising model from [16] and used effectively in the Stochastic Optimal Control of Advertising [12]. This model of reputation is combined with the effect of online reputation on sales price empirically verified in [9]. We derive the Hamilton-Jacobi-Bellman (HJB) differential equation, whose solution relates optimal wealth level to a seller’s reputation. We formulate both a full model, as well as a reduced model with fewer parameters, both of which have the same qualitative description of the optimal seller behavior. Coincidentally, the reduced model has a closed form analytical solution that we construct.
منابع مشابه
Designing Reputation Mechanisms for Efficient Trade
A seller in an online marketplace with an effective reputation mechanism should expect that dishonest behavior results in higher payments now, while honest behavior results in higher reputation—and thus higher payments—in the future. We study two widely used classes of reputation mechanisms. First, we show that weighting all past ratings equally gives sellers an incentive to falsely advertise. ...
متن کاملAutomated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal online mechanisms. This work generally assumes that the size of the market (number of bidders) is known a priori, but that the mechanism designer has no knowledge of the distribution of bid values. However, in many real-worl...
متن کاملAn Application of the Stochastic Optimal Control Algorithm (OPTCON) to the Public Sector Economy of Iran
In this paper we first describe the stochastic optimal control algorithm called ((OPTCON)). The algorithm minimizes an intertemporal objective loss function subject to a nonlinear dynamic system in order to achieve optimal value of control (or instrument) variables. Second as an application, we implemented the algorithm by the statistical programming system ((GAUSS)) to determine the optimal fi...
متن کاملMechanism Design for a Risk Averse Seller
We develop efficient algorithms to construct approximately utility maximizing mechanisms for a risk averse seller in the presence of potentially risk-averse buyers in Bayesian single parameter and multiparameter settings. We model risk aversion by concave utility function. Bayesian mechanism design has usually focused on maximizing expected revenue in a risk-neutral environment, i.e. where all ...
متن کاملAn Online Q-learning Based Multi-Agent LFC for a Multi-Area Multi-Source Power System Including Distributed Energy Resources
This paper presents an online two-stage Q-learning based multi-agent (MA) controller for load frequency control (LFC) in an interconnected multi-area multi-source power system integrated with distributed energy resources (DERs). The proposed control strategy consists of two stages. The first stage is employed a PID controller which its parameters are designed using sine cosine optimization (SCO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011